#include<bits/stdc++.h>
using namespace std;
int n,r[100008],ans=0,vis[100008];
int main()
{
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&r[i]);
		}
	sort(r+1,r+n+1);
	for(int i=1;i<=n;i++)
	 for(int j=i+1;j<=n;j++)
	 {
		 if(r[j]>r[i]&&vis[j]==0)
		 {
			 ans++;
			 vis[j]=1;
			 break;
			 }
		 }
		 cout<<n-ans<<endl;
	return 0;
	} 
